An annealing mutation operator in the genetic algorithms for RNA folding
نویسندگان
چکیده
منابع مشابه
An annealing mutation operator in the genetic algorithms for RNA folding
An annealing mutation operator in the genetic algorithms (GA) for RNA folding on a MasPar MP-2 has been designed. The mutation probability descends along a hyperbola with respect to the size of the secondary structure, hence the total number of mutations at each generation drops linearly. Especially for long sequences with thousands of nucleotides as opposed to hundreds of nucleotides, the new ...
متن کاملA Directed Mutation Operator for Real Coded Genetic Algorithms
Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper introduces a directed mutation (DM) operator for GAs to explore promising areas in the search space. In this DM method, the statistics information regarding the fitness and distribution of individuals over intervals of each dime...
متن کاملGenetic Algorithms as Reshufflers and the Anti-Mutation Operator
The goal of this paper is to study the dynamics of a genetic algorithm in a more visual, intuitive way than statistical methods do. Rather than modeling the genetic algorithm mathematically, we try to describe how the GA scans through the search space, and how genotypes move through the search space as genetic operators are applied to them. We find that standard genetic operators can be describ...
متن کاملAutomated Crossover and Mutation Operator Selection on Genetic Algorithms
Genetic Algorithms (GAs) have proven to be a useful means of finding optimal or near optimal solutions to hard problems that are difficult to solve by other means. However, determining which crossover and mutation operator is best to use for a specific problem can be a complex task requiring much trial and error. Furthermore, different operators may be better suited to exploring the search spac...
متن کاملAnnealing Ant Colony Optimization with Mutation Operator for Solving TSP
Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 1996
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/12.3.171